package CSDN.hzh22_10_30;

import java.util.ArrayList;
import java.util.Scanner;

/**
 * @Description:
 * @Author: Hanzao
 * @Date: 2022/10/30/11:07
 */
public class test_10_23_3 {
    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);
        String str_0 = scan.nextLine().trim();
        int n = Integer.parseInt(str_0);




        ArrayList<ArrayList<Integer>> vector = new ArrayList<>();
        for(int i = 0; i < n; i++){
            String str_1 = scan.nextLine();
            String[] line_list_1 = str_1.trim().split(" ");
            ArrayList<Integer> temp_1 = new ArrayList<>();
            for(int j = 0; j < line_list_1.length; j++){
                temp_1.add(Integer.parseInt(line_list_1[j]));
            }
            vector.add(temp_1);
        }


        scan.close();

        int result = solution(n, vector);

        System.out.println(result);

    }

    public static int solution(int n, ArrayList<ArrayList<Integer>> vector){
        int result = 0;

        // TODO: 请在此编写代码
        Scanner scan=new Scanner(System.in);
        int r=scan.nextInt();
        int c=scan.nextInt();
        int[][]matrix=new int[r][c];
        scan.nextLine();

        return result;
    }

    private static int min(int x, int y, int z) {
        if (x < y)
            return (x < z) ? x : z;
        else
            return (y < z) ? y : z;
    }

    private static int minCost(int cost[][], int m, int n) {
        int i, j;
        int tc[][] = new int[m + 1][n + 1];

        tc[0][0] = cost[0][0];

        /* Initialize first column of total cost(tc) array */
        for (i = 1; i <= m; i++)
            tc[i][0] = tc[i - 1][0] + cost[i][0];

        /* Initialize first row of tc array */
        for (j = 1; j <= n; j++)
            tc[0][j] = tc[0][j - 1] + cost[0][j];

        /* Construct rest of the tc array */
        for (i = 1; i <= m; i++)
            for (j = 1; j <= n; j++)
                tc[i][j] = min(tc[i - 1][j - 1], tc[i - 1][j], tc[i][j - 1]) + cost[i][j];

        return tc[m][n];
    }
}


